Close
Metadata

1. Identity statement
Reference TypeConference Paper (Conference Proceedings)
Sitesibgrapi.sid.inpe.br
Holder Codeibi 8JMKD3MGPEW34M/46T9EHH
Identifier8JMKD3MGPBW34M/3C9GD5E
Repositorysid.inpe.br/sibgrapi/2012/07.13.03.02
Last Update2012:07.13.03.02.54 (UTC) administrator
Metadata Repositorysid.inpe.br/sibgrapi/2012/07.13.03.02.54
Metadata Last Update2022:06.14.00.07.31 (UTC) administrator
DOI10.1109/SIBGRAPI.2012.43
Citation KeySouzaLotuRitt:2012:CoOpFo
TitleA Comparison between Optimum-Path Forest and k-Nearest Neighbors Classifiers
FormatDVD, On-line.
Year2012
Access Date2024, Apr. 29
Number of Files1
Size2170 KiB
2. Context
Author1 Souza, Roberto Medeiros de
2 Lotufo, Roberto de Alencar
3 Rittner, Letícia
Affiliation1 UNICAMP 
2 UNICAMP 
3 UNICAMP
EditorFreitas, Carla Maria Dal Sasso
Sarkar, Sudeep
Scopigno, Roberto
Silva, Luciano
e-Mail Addressroberto.medeiros.souza@gmail.com
Conference NameConference on Graphics, Patterns and Images, 25 (SIBGRAPI)
Conference LocationOuro Preto, MG, Brazil
Date22-25 Aug. 2012
PublisherIEEE Computer Society
Publisher CityLos Alamitos
Book TitleProceedings
Tertiary TypeFull Paper
History (UTC)2012-09-20 16:45:34 :: roberto.medeiros.souza@gmail.com -> administrator :: 2012
2022-03-08 21:03:23 :: administrator -> menottid@gmail.com :: 2012
2022-03-10 13:04:56 :: menottid@gmail.com -> administrator :: 2012
2022-06-14 00:07:31 :: administrator -> :: 2012
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Version Typefinaldraft
Keywordsk-Nearest Neighbors
Optimum-Path Forest
decision boundaries
classification
AbstractThis paper presents a comparison between the k- Nearest Neighbors, with an especial focus on the 1-Nearest Neighbor, and the Optimum-Path Forest supervised classifiers. The first was developed in the 1960s, while the second was recently proposed in the 2000s. Although, they were developed around 40 years apart, we can find many similarities between them, especially between 1-Nearest Neighbor and Optimum-Path Forest. This work shows that the Optimum-Path Forest classifier is equivalent to the 1-Nearest Neighbor classifier when all training samples are used as prototypes. The decision boundaries generated by the classifiers are analysed and also some simulations results for both algorithms are presented to compare their performances in real and synthetic data.
Arrangement 1urlib.net > SDLA > Fonds > SIBGRAPI 2012 > A Comparison between...
Arrangement 2urlib.net > SDLA > Fonds > Full Index > A Comparison between...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Content
agreement.html 13/07/2012 00:02 0.7 KiB 
4. Conditions of access and use
data URLhttp://urlib.net/ibi/8JMKD3MGPBW34M/3C9GD5E
zipped data URLhttp://urlib.net/zip/8JMKD3MGPBW34M/3C9GD5E
Languageen
Target File102142.pdf
User Grouproberto.medeiros.souza@gmail.com
Visibilityshown
5. Allied materials
Mirror Repositorysid.inpe.br/banon/2001/03.30.15.38.24
Next Higher Units8JMKD3MGPEW34M/46SL8GS
8JMKD3MGPEW34M/4742MCS
Citing Item Listsid.inpe.br/sibgrapi/2022/05.15.03.31 5
Host Collectionsid.inpe.br/banon/2001/03.30.15.38
6. Notes
Empty Fieldsarchivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination documentstage edition electronicmailaddress group isbn issn label lineage mark nextedition notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url volume


Close